Bicriteria Resource Allocation Problem in Pert Networks

Authors

Abstract:

We develop a bicriteria model for the resource allocation problem in PERT networks, in which the total direct costs of the project as the first objective, and the mean of project completion time as the second objective are minimized. The activity durations are assumed to be independent random variables with either exponential or Erlang distributions, in which the mean of each activity duration is a non-increasing function of the amount of resource allocated to it. The direct cost of each activity is assumed to be a non-decreasing function of the amount of resource allocated to it. Finally, we use the goal attainment method to solve the related bicriteria optimal control problem numerically, by converting this problem to a related bicriteria nonlinear programming, and obtain the optimal values of the resources allocated to the activities.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A multi-objective resource allocation problem in PERT networks

We develop a multi-objective model for resource allocation problem in PERT networks with exponentially or Erlang distributed activity durations, where the mean duration of each activity is a non-increasing function and the direct cost of each activity is a non-decreasing function of the amount of resource allocated to it. The decision variables of the model are the allocated resource quantities...

full text

A multi-objective resource allocation problem in dynamic PERT networks

We develop a multi-objective model for the resource allocation problem in a dynamic PERT network, where the activity durations are exponentially distributed random variables and the new projects are generated according to a Poisson process. This dynamic PERT network is represented as a network of queues, where the service times represent the durations of the corresponding activities and the arr...

full text

A Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks

The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...

full text

A heuristic method for consumable resource allocation in multi-class dynamic PERT networks

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...

full text

Resource allocation in dynamic PERT networks with finite capacity

Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran Michael Smurfit Graduate School of Business, University College Dublin, Dublin, Ireland Department of Industrial Engineering, Faculty of Engineering, University of Tehran, Tehran, Iran Department of Financial Engineering and Engineering Management, School of Science and Engineering, Reykjavik Universit...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 17  issue 2

pages  157- 168

publication date 2004-06-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023